|
In computer science a retroactive data structure is data structure which supports efficient modifications to a sequence of operations that have been performed on the structure. These modifications can take the form of retroactive insertion, deletion or updating an operation that was performed at some time in the past.〔 == Some applications of retroactive data structures == In the real world there are many cases where one would like to modify a past operation from a sequence of operations. Listed below are some of the possible applications: * ''Error correction'': Incorrect input of data. The data should be corrected and all the secondary effects of the incorrect data be removed. * ''Bad data'': When dealing with large systems, particular those involving a large amount of automated data transfer, it is not uncommon. For example suppose one of the sensors for a weather network malfunctions and starts to report garbage data or incorrect data. The ideal solution would be to remove all the data that the sensor produced since it malfunctioned along with all the effects the bad data had on the overall system. * ''Recovery'': Suppose that a hardware sensor was damaged but is now repaired and data is able to be read from the sensor. We would like to be able to insert the data back into the system as if the sensor was never damaged in the first place. * ''Manipulation of the past'': Changing the past can be helpful in the cases of damage control and retroactive data structures are designed for intentional manipulation of the past. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Retroactive data structures」の詳細全文を読む スポンサード リンク
|